28 research outputs found
Metastability in the dilute Ising model
Consider Glauber dynamics for the Ising model on the hypercubic lattice with
a positive magnetic field. Starting from the minus configuration, the system
initially settles into a metastable state with negative magnetization. Slowly
the system relaxes to a stable state with positive magnetization. Schonmann and
Shlosman showed that in the two dimensional case the relaxation time is a
simple function of the energy required to create a critical Wulff droplet.
The dilute Ising model is obtained from the regular Ising model by deleting a
fraction of the edges of the underlying graph. In this paper we show that even
an arbitrarily small dilution can dramatically reduce the relaxation time. This
is because of a catalyst effect---rare regions of high dilution speed up the
transition from minus phase to plus phase.Comment: 49 page
One-sided versus two-sided stochastic descriptions
It is well-known that discrete-time finite-state Markov Chains, which are
described by one-sided conditional probabilities which describe a dependence on
the past as only dependent on the present, can also be described as
one-dimensional Markov Fields, that is, nearest-neighbour Gibbs measures for
finite-spin models, which are described by two-sided conditional probabilities.
In such Markov Fields the time interpretation of past and future is being
replaced by the space interpretation of an interior volume, surrounded by an
exterior to the left and to the right.
If we relax the Markov requirement to weak dependence, that is, continuous
dependence, either on the past (generalising the Markov-Chain description) or
on the external configuration (generalising the Markov-Field description), it
turns out this equivalence breaks down, and neither class contains the other.
In one direction this result has been known for a few years, in the opposite
direction a counterexample was found recently. Our counterexample is based on
the phenomenon of entropic repulsion in long-range Ising (or "Dyson") models.Comment: 13 pages, Contribution for "Statistical Mechanics of Classical and
Disordered Systems
Self-avoiding walks and connective constants
The connective constant of a quasi-transitive graph is the
asymptotic growth rate of the number of self-avoiding walks (SAWs) on from
a given starting vertex. We survey several aspects of the relationship between
the connective constant and the underlying graph .
We present upper and lower bounds for in terms of the
vertex-degree and girth of a transitive graph.
We discuss the question of whether for transitive
cubic graphs (where denotes the golden mean), and we introduce the
Fisher transformation for SAWs (that is, the replacement of vertices by
triangles).
We present strict inequalities for the connective constants
of transitive graphs , as varies.
As a consequence of the last, the connective constant of a Cayley
graph of a finitely generated group decreases strictly when a new relator is
added, and increases strictly when a non-trivial group element is declared to
be a further generator.
We describe so-called graph height functions within an account of
"bridges" for quasi-transitive graphs, and indicate that the bridge constant
equals the connective constant when the graph has a unimodular graph height
function.
A partial answer is given to the question of the locality of
connective constants, based around the existence of unimodular graph height
functions.
Examples are presented of Cayley graphs of finitely presented
groups that possess graph height functions (that are, in addition, harmonic and
unimodular), and that do not.
The review closes with a brief account of the "speed" of SAW.Comment: Accepted version. arXiv admin note: substantial text overlap with
arXiv:1304.721